Uniform $$l^2$$-Decoupling in $$\mathbb R^2$$ for Polynomials
نویسندگان
چکیده
منابع مشابه
Uniform Asymptotics for Orthogonal Polynomials
We consider asymptotics of orthogonal polynomials with respect to a weight e ?Q(x) dx on R, where either Q(x) is a polynomial of even order with positive leading coeecient, or Q(x) = NV (x), where V (x) is real analytic on R and grows suuciently rapidly as jxj ! 1. We formulate the orthogonal polynomial problem as a Riemann-Hilbert problem following the work of Fokas, Its and Kitaev. We employ ...
متن کاملComputing the generator polynomials of $\mathbb{Z}_2\mathbb{Z}_4$-additive cyclic codes
A Z2Z4-additive code C ⊆ Z α 2 × Z β 4 is called cyclic if the set of coordinates can be partitioned into two subsets, the set of Z2 and the set of Z4 coordinates, such that any simultaneous cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be identified as submodules of the Z4[x]-module Z2[x]/(x − 1)×Z4[x]/(x −1). Any Z2Z4-additive cyclic code C is of t...
متن کاملCounting Roots of Polynomials over $\mathbb{Z}/p^2\mathbb{Z}$
Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors. Fix a prime p ∈ Z and f ∈ (Z/pZ)[x] any nonzero polynomial of degree d whose coefficients are not all divisible by p. For the case n = 2, we prove a new effi...
متن کاملUniform Asymptotic Expansions for Charlier Polynomials
The asymptotic behaviour of the Charlier polynomials C (a) n (x) as nQ. is examined. These polynomials satisfy a discrete orthogonality relation and, unlike classical orthogonal polynomials, do not satisfy a second-order linear differential equation with respect to the independent variable x. As such, previous results on their asymptotic behaviour have been restricted to integral methods and co...
متن کاملDecoupling Multivariate Polynomials Using First-Order Information
We present a method to decompose a set of multivariate real polynomials into linear combinations of univariate polynomials in linear forms of the input variables. The method proceeds by collecting the first-order information of the polynomials in a set of operating points, which is captured by the Jacobian matrix evaluated at the operating points. The polyadic canonical decomposition of the thr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Geometric Analysis
سال: 2021
ISSN: 1050-6926,1559-002X
DOI: 10.1007/s12220-021-00666-5